The bondage number of graphs on topological surfaces and Teschner's conjecture
نویسندگان
چکیده
The bondage number of a graph is the smallest number of its edges whose removal results in a graph having a larger domination number. We provide constant upper bounds for the bondage number of graphs on topological surfaces, improve upper bounds for the bondage number in terms of the maximum vertex degree and the orientable and non-orientable genera of the graph, and show tight lower bounds for the number of vertices of graphs 2-cell embeddable on topological surfaces of a given genus. Also, we provide stronger upper bounds for graphs with no triangles and graphs with the number of vertices larger than a certain threshold in terms of the graph genera. This settles Teschner’s Conjecture in positive for almost all graphs.
منابع مشابه
Note on the bondage number of graphs on topological surfaces
The bondage number b(G) of a graph G is the smallest number of edges whose removal from G results in a graph with larger domination number. In this paper, we present new upper bounds for b(G) in terms of girth, order and Euler characteristic.
متن کاملUpper bounds for the bondage number of graphs on topological surfaces
The bondage number b(G) of a graph G is the smallest number of edges of G whose removal results in a graph having the domination number larger than that of G. In a sense, the bondage number b(G) measures integrity and reliability of the domination number γ(G) with respect to the edge removal, which corresponds, e.g., to link failures in communication networks. We show that, for a graph G having...
متن کاملUpper Bounds for Domination Related Parameters in Graphs on Surfaces
Abstract. In this paper we give tight upper bounds on the total domination number, the weakly connected domination number and the connected domination number of a graph in terms of order and Euler characteristic. We also present upper bounds for the restrained bondage number, the total restrained bondage number and the restricted edge connectivity of graphs in terms of the orientable/nonorienta...
متن کاملOn the bondage number of planar and directed graphs
The bondage number b(G) of a nonempty graph G is defined to be the cardinality of the smallest set E of edges of G such that the graph G − E has domination number greater than that of G. In this paper we present a simplified proof that b(G) ≤ min{8,∆(G) + 2} for all planar graphs G, give examples of planar graphs with bondage number 6, and bound the bondage number of directed graphs.
متن کاملThe bondage numbers and efficient dominations of vertex-transitive graphs
The bondage number of a graph G is the minimum number of edges whose removal results in a graph with larger domination number.A dominating setD is called an efficient dominating set ofG if |N−[v]∩D|=1 for every vertex v ∈ V (G). In this paper we establish a tight lower bound for the bondage number of a vertex-transitive graph. We also obtain upper bounds for regular graphs by investigating the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 313 شماره
صفحات -
تاریخ انتشار 2013